Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
21	LNCSParallel Repetition of Computationally Sound Protocols Revisited Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:49:12 Computational complexity theory Theory of computation Cryptography Complexity classes Quantum complexity theory IP Proof of knowledge NP PP XTR PSPACE Communications protocol
22	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
23	Falso: a simple, self-consistent logic Antoine Amarilli Club Inutile & Estatis, Inc. Scholarly Outreach Division 1 Accounting Dr., Mariana Trench, Intl. Waters Add to Reading List Source URL: www.ben-sherman.net Language: English - Date: 2016-08-02 11:41:55 Logic Mathematical logic Mathematics Automated theorem proving Model theory Proof theory Complexity classes Logical connectives NP IP Negation Coq
24	Fast Algorithms for Differential Equations in Positive Characteristic Alin Bostan (INRIA, France) joint work with ´ Schost (University of Western Ontario, Canada) Add to Reading List Source URL: issac2009.kias.re.kr Language: English - Date: 2009-07-30 00:31:17 Algebra Mathematics Abstract algebra Polynomials Complexity classes Finite fields Computer algebra SL XTR FP Differential operator Polynomial interpolation
25	Northern Territory – Top End Region Van Diemen Gulf Beagle Gulf Maningrida Add to Reading List Source URL: www.apollocamper.com Language: English - Date: 2008-12-11 18:42:30 Complexity classes NP Northern Territory
26	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-02-25 05:09:48 Cryptography Computational complexity theory Theory of computation Complexity classes Probabilistic complexity theory Public-key cryptography NP IP Proof of knowledge Zero-knowledge proof Random oracle FiatShamir heuristic
27	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
28	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
29	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
30	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem